Non-sparse Companion Matrices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nil-clean Companion Matrices

The classes of clean and nil-clean rings are closed with respect standard constructions as direct products and (triangular) matrix rings, cf. [12] resp. [4], while the classes of weakly (nil-)clean rings are not closed under these constructions. Moreover, while all matrix rings over fields are clean, [12] when we consider nil-clean rings there are strongly restrictions: if a matrix ring over a ...

متن کامل

Linear Construction of Companion Matrices

This note is concerned with the following problem: For a given matrix A E C’Ix” and a vector a E C”, does there exist a mapping 2’ assigning to each manic polynomial f of degree n a vector X(f) E C” such that the matrix B := A a. X(f)’ is a companion matrix off, i.e., the characteristic polynomial of B is t l)“ftf’ The classes of suitable matrices A and vectors a are characterized, and some pro...

متن کامل

On product of companion matrices

Article history: Received 15 December 2010 Accepted 10 May 2011 Available online 21 June 2011 Submitted by R.A. Brualdi AMS classification: 05A15 15A06 39A05

متن کامل

A note on companion matrices

We show that the usual companion matrix of a polynomial of degree n can be factored into a product of n matrices, n− 1 of them being the identity matrix in which a 2 × 2 identity submatrix in two consecutive rows (and columns) is replaced by an appropriate 2 × 2 matrix, the remaining being the identity matrix with the last entry replaced by possibly different entry. By a certain similarity tran...

متن کامل

Roots Multiplicity without Companion Matrices

We show a method for constructing a polynomial interpolating roots’ multiplicities of another polynomial, that does not use companion matrices. This leads to a modification to Guersenzvaig– Szechtman square-free decomposition algorithm that is more efficient both in theory and in practice. The problem of computing the square-free decomposition of a polynomial is well established in the realm of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Linear Algebra

سال: 2019

ISSN: 1081-3810

DOI: 10.13001/1081-3810.3839